#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;

//数组中只出现一次的数字
void FindNumsAppearOnce(vector<int> data, int *num1, int *num2)
{
    unordered_map<int, int> hashmap;
    int len = data.size();
    for (int i = 0; i < len; ++i)
    {
        hashmap[data[i]]++;
    }
    unordered_map<int, int>::iterator it = hashmap.begin();
    vector<int> res;
    while (it != hashmap.end())
    {
        if ((*it).second == 1)
        {
            res.push_back((*it).first);
        }
        it++;
    }
    *num1 = res[0];
    *num2 = res[1];
}

void test()
{
}

int main()
{
    test();
    return 0;
}